#include "link_list.h"

Elenemt_data Stu_data[50] = 
{
 { .name = "刘备" , .sex = "男" , .sco = 60 , .age = 18 , .id = 1  },
 { .name = "关羽" , .sex = "男" , .sco = 60 , .age = 18 , .id = 2  },
 { .name = "张飞" , .sex = "女" , .sco = 60 , .age = 18 , .id = 3  },
 { .name = "诸葛" , .sex = "男" , .sco = 60 , .age = 18 , .id = 4  },
 { .name = "赵云" , .sex = "男" , .sco = 60 , .age = 18 , .id = 5  },
 { .name = "马超" , .sex = "男" , .sco = 60 , .age = 18 , .id = 6  },
 { .name = "祝融" , .sex = "女" , .sco = 60 , .age = 18 , .id = 7  },
 { .name = "小乔" , .sex = "女" , .sco = 60 , .age = 18 , .id = 8  },
 { .name = "大乔" , .sex = "女" , .sco = 60 , .age = 18 , .id = 9  },
 { .name = "貂蝉" , .sex = "女" , .sco = 60 , .age = 18 , .id = 10  }
};

void test(void)
{
    Link_list * L = init_link_list();
    Node * new_node = (Node *)malloc(sizeof(Node)); // 创建结点
    L->next = new_node; // 将结点 链接到 头节点

    printf("\n\n=============== 尾插 ===============\n\n");
    //链表的尾插
    L->next->data = Stu_data[0];
    insert_node_tail(L , Stu_data[1]);
    insert_node_tail(L , Stu_data[2]);
    insert_node_tail(L , Stu_data[3]);
    insert_node_tail(L , Stu_data[4]);
    insert_node_tail(L , Stu_data[5]);

    print_link_list(L);

    printf("\n\n=============== 尾删 ===============\n\n");
    //链表的尾删
    delete_node_tail(L);

    // 遍历
    print_link_list(L);

    //销毁链表
    free_link_list(&L);




}


int main(int argc, char const *argv[])
{
    test();
    return 0;
}


